Composition methods for the integration of dynamical neural networks

نویسندگان

  • Yves Moreau
  • Joos Vandewalle
چکیده

We apply the symmetric composition method for the integration of ordinary diierential equations to dynamical neural networks. In this method, we split the vector eld, which is parameterized by a neural network, into the contribution of each of its neurons. We then solve the elementary diierential equation associated to each neuron separately , and recombine these contributions in a sequence of compositions. This gives rise to simple integration rules for dynamical neural networks, which we present for dynamical single-hidden-layer perceptrons.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PROJECTED DYNAMICAL SYSTEMS AND OPTIMIZATION PROBLEMS

We establish a relationship between general constrained pseudoconvex optimization problems and globally projected dynamical systems. A corresponding novel neural network model, which is globally convergent and stable in the sense of Lyapunov, is proposed. Both theoretical and numerical approaches are considered. Numerical simulations for three constrained nonlinear optimization problems a...

متن کامل

Submitted to Ieee Transactions on Neural Networks

We present a new approach to the modeling of continuous-time systems observed in discrete time. The rationale behind this approach is that discrete-time models of continuous-time systems ought to be invertible and that we therefore should investigate group theoretic methods: We use compositions of invertible basis transformations to approximate the (invertible) map of a dynamical system. The ap...

متن کامل

Integration of Color Features and Artificial Neural Networks for In-field Recognition of Saffron Flower

ABSTRACT-Manual harvesting of saffron as a laborious and exhausting job; it not only raises production costs, but also reduces the quality due to contaminations. Saffron quality could be enhanced if automated harvesting is substituted. As the main step towards designing a saffron harvester robot, an appropriate algorithm was developed in this study based on image processing techniques to recogn...

متن کامل

FINITE-TIME PASSIVITY OF DISCRETE-TIME T-S FUZZY NEURAL NETWORKS WITH TIME-VARYING DELAYS

This paper focuses on the problem of finite-time boundedness and finite-time passivity of discrete-time T-S fuzzy neural networks with time-varying delays. A suitable Lyapunov--Krasovskii functional(LKF) is established to derive sufficient condition for finite-time passivity of discrete-time T-S fuzzy neural networks. The dynamical system is transformed into a T-S fuzzy model with uncertain par...

متن کامل

Solving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks

‎Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎In this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎Then‎, ‎we use...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997